Generalized Helicoids for Modeling Hair Geometry

نویسندگان

  • Emmanuel Piuze
  • Paul G. Kry
  • Kaleem Siddiqi
چکیده

In computer graphics, modeling the geometry of hair and hair-like patterns such as grass and fur remains a significant challenge. Hair strands can exist in an extensive variety of arrangements and the choice of an appropriate representation for tasks such as hair synthesis, fitting, editing, or reconstruction from samples, is non-trivial. To support such applications we present a novel mathematical representation of hair based on a class of minimal surfaces called generalized helicoids. This representation allows us to characterize the geometry of a single hair strand, as well as of those in its vicinity, by three intuitive curvature parameters and an elevation angle. We introduce algorithms for fitting piecewise generalized helicoids to unparameterized hair strands, and for interpolating hair between these fits. We showcase several applications of this representation including the synthesis of different hair geometries, wisp generation, hair interpolation from samples and hair-style parametrization and reconstruction from real hair data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Helicoids for Hair Modeling

Recently, Savadjiev et al. introduced a generalized helicoid as an osculating object to characterize near parallel 3D curve patterns. This new model allows for patterns of different kinds to be examined and generated via three curvature parameters. The parameterization can be efficiently used to model hair strands. We present an investigation of the usability of the generalized helicoid model f...

متن کامل

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

The Geometry of Genus-one Helicoids

We analyze the geometric structure of properly embedded, helicoidlike minimal surfaces in R.

متن کامل

Application of Response Surface Methodology for Modeling the Color Strength of Natural Hair Colorant

Application of Response Surface Methodology for Modeling the Color Strength of Natural Hair Colorant

متن کامل

Theory of helicoids and skyrmions in confined cholesteric liquid crystals.

Cholesteric liquid crystals experience geometric frustration when they are confined between surfaces with anchoring conditions that are incompatible with the cholesteric twist. Because of this frustration, they develop complex topological defect structures, which may be helicoids or skyrmions. We develop a theory for these structures, which extends previous theoretical research by deriving exac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2011